Detecting regularities on grammar-compressed strings
نویسندگان
چکیده
منابع مشابه
Detecting Regularities on Grammar-Compressed Strings
We solve the problems of detecting and counting various forms of regularities in a string represented as a Straight Line Program (SLP). Given an SLP of size n that represents a string s of length N , our algorithm compute all runs and squares in s in O(nh) time and O(n) space, where h is the height of the derivation tree of the SLP. We also show an algorithm to compute all gapped-palindromes in...
متن کاملBookmarks in Grammar-Compressed Strings
We consider the problem of storing a grammar of size n compressing a string of size N , and a set of positions {i1, . . . , ib} (bookmarks) such that any substring of length l crossing one of the positions can be decompressed in O(l) time. Our solution uses space O((n+ b) max{1, log∗ n− log∗(n b + b n )}). Existing solutions for the bookmarking problem either require more space or a super-const...
متن کاملData Structures for Grammar-compressed Strings
This thesis presents new algorithms and data structures for handling data represented as grammar-compressed strings. The compression scheme we focus on is the Straight Line Program (SLP). In the following, S is an SLP of size n compressing a string S of size N . We consider the following problems. The q-gram profile of a compressed string. We present an algorithm for computing the q-gram profil...
متن کاملThreshold Approximate Matching in Grammar-Compressed Strings
A grammar-compressed (GC) string is a string generated by a context-free grammar. This compression model captures many practical applications, and includes LZ78 and LZW compression as a special case. We give an efficient algorithm for threshold approximate matching on a GC-text against a plain pattern. Our algorithm improves on existing algorithms whenever the pattern is sufficiently long. The ...
متن کاملAlgorithms and data structures for grammar - compressed strings
This thesis presents new algorithms and data structures for handling data represented as grammar-compressed strings. The compression scheme we focus on is the Straight Line Program (SLP). In the following, S is an SLP of size n compressing a string S of size N . We consider the following problems. The q-gram profile of a compressed string. We present an algorithm for computing the q-gram profil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2015
ISSN: 0890-5401
DOI: 10.1016/j.ic.2014.09.009